Cloudlet-based just-in-time indexing of IoT video

P

Towards a multimedia remote viewer for mobile thin clients

Be there a traditional mobile user wanting to connect to a remote multimedia server. In order to allow them to enjoy the same user experience remotely (play, interact, edit, store and share capabilities) as in a traditional fixed LAN environment, several dead-locks are to be dealt with: (1) a heavy and heterogeneous content should be sent through a bandwidth constrained network; (2) the displayed content should be of good quality; (3) user interaction should be processed in real-time and (4) the complexity of the practical solution should not exceed the features of the mobile client in terms of CPU, memory and battery. The present paper takes this challenge and presents a fully operational MPEG-4 BiFS solution

Coherent collective behaviour emerging from decentralised balancing of social feedback and noise

Decentralised systems composed of a large number of locally interacting agents often rely on coherent behaviour to execute coordinated tasks. Agents cooperate to reach a coherent collective behaviour by aligning their individual behaviour to the one of their neighbours. However, system noise, determined by factors such as individual exploration or errors, hampers and reduces collective coherence. The possibility to overcome noise and reach collective coherence is determined by the strength of social feedback, i.e. the number of communication links. On the one hand, scarce social feedback may lead to a noise-driven system and consequently incoherent behaviour within the group. On the other hand, excessively strong social feedback may require unnecessary computing by individual agents and/or may nullify the possible benefits of noise. In this study, we investigate the delicate balance between social feedback and noise, and its relationship with collective coherence. We perform our analysis through a locust-inspired case study of coherently marching agents, modelling the binary collective decision-making problem of symmetry breaking. For this case study, we analytically approximate the minimal number of communication links necessary to attain maximum collective coherence. To validate our findings, we simulate a 500-robot swarm and obtain good agreement between theoretical results and physics-based simulations. We illustrate through simulation experiments how the robot swarm, using a decentralised algorithm, can adaptively reach coherence for various noise levels by regulating the number of communication links. Moreover, we show that when the system is disrupted by increasing and decreasing the robot density, the robot swarm adaptively responds to these changes in real time. This decentralised adaptive behaviour indicates that the derived relationship between social feedback, noise and coherence is robust and swarm size independent

On the Feasibility of Using Current Data Centre Infrastructure for Latency-sensitive Applications

IEEE It has been claimed that the deployment of fog and edge computing infrastructure is a necessity to make high-performance cloud-based applications a possibility. However, there are a large number of middle-ground latency-sensitive applications such as online gaming, interactive photo editing and multimedia conferencing that require servers deployed closer to users than in globally centralised clouds but do not necessarily need the extreme low-latency provided by a new infrastructure of micro data centres located at the network edge, e.g. in base stations and ISP Points of Presence. In this paper we analyse a snapshot of today & #x0027;s data centres and the distribution of users around the globe and conclude that existing infrastructure provides a sufficiently distributed platform for middle-ground applications requiring a response time of $20-200\;ms$ . However, while placement and selection of edge servers for extreme low-latency applications is a relatively straightforward matter of choosing the closest, providing a high quality of experience for middle-ground latency applications that use the more widespread distribution of today & #x0027;s data centres, as we advocate in this paper, raises new management challenges to develop algorithms for optimising the placement of and the per-request selection between replicated service instances